A simple proof of a well-known oscillation theorem
نویسندگان
چکیده
منابع مشابه
A simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملA Simple Proof of Sharkovsky's Theorem Revisited
Sharkovsky’s theorem [1], [5], [6] claims its place among the gems of dynamical systems mainly because of its simple hypotheses and strong conclusion. Loosely speaking, it states that, if f is a continuous map from a compact interval I into itself that has a period-m point, then f also has a period-n point whenever m ≺ n in the Sharkovsky’s ordering ≺ of the natural numbers but may not have a p...
متن کاملA simple proof of Sharkovsky’s theorem rerevisited
In proving the celebrated Sharkovsky cycle coexistence theorem, the standard arguments [1, 2] (see also [4, 10, 14]) reduce the proof to considering only the case where the continuous map has periodic orbits of odd periods ≥ 3 (MR591173(82j:58097)) and then prove that some such periodic orbits have the structures of the so-called Štefan cycles and draw the desired conclusions from the directed ...
متن کاملA Simple Proof of Sharkovsky's Theorem
In this note, we present a simple directed graph proof of Sharkovsky’s theorem.
متن کاملA Simple Proof of Toda's Theorem
Toda in his celebrated paper showed that the polynomial-time hierarchy is contained in P#P. We give a short and simple proof of the first half of Toda’s Theorem that the polynomial-time hierarchy is contained in BPP⊕P. Our proof uses easy consequences of relativizable proofs of results that predate Toda. For completeness we also include a proof of the second half of Toda’s Theorem. ACM Classifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1968-0223644-0